Capturing Crossings: Convex Hulls of Segment and Plane Intersections
نویسندگان
چکیده
We give a simple O(n log n) algorithm to compute the convex hull of the (possibly Θ(n)) intersection points in an arrangement of n line segments in the plane. We also show an arrangement of dn planes in d-dimensions whose arrangement has Θ(nd−1) intersection points on the convex hull.
منابع مشابه
Algorithms for ball hulls and ball intersections in strictly convex normed planes
Extending results of Hershberger and Suri for the Euclidean plane, we show that ball hulls and ball intersections of sets of n points in strictly convex normed planes can be constructed in O(n log n) time. In addition, we confirm that, like in the Euclidean subcase, the 2-center problem with constrained circles can be solved also for strictly convex normed planes in O(n2) time. Some ideas for e...
متن کاملRandomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
We show that the well-known random incremental construction of Clarkson and Shor can be adapted to provide efficient external-memory algorithms for some geometric problems. In particular, as the main result, we obtain an optimal randomized algorithm for the problem of computing the trapezoidal decomposition determined by a set of N line segments in the plane with K pairwise intersections, that ...
متن کاملConvex Hull of Grid Points below a Line or a Convex Curve
Consider a nite non-vertical, and non-degenerate straight-line segment s = s0; s1] in the Euclidian plane E 2. We give a method for constructing the boundary of the upper convex hull of all the points with integral coordinates below (or on) s, with abscissa in x(s0); x(s1)]. The algorithm takes O(log n) time, if n is the length of the segment. We next show how to perform a similar construction ...
متن کاملRelationship between Pedestrians’ Speed, Density and Flow Rate of Crossings through Urban Intersections (Case Study: Rasht Metropolis) (RESEARCH NOTE)
Travels within the city are done in different ways, by vehicle or on foot. Thus, inevitably, a part of the travel is always done on foot. Since intersections as traffic nodes are determinant factor in transportation network capacity, any disruption in them leads to severe reduction in network capacity. Unfortunately, pedestrian behavior has received little attention in Iran. While this is a ver...
متن کاملAn Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
This paper describes a linear-time algorithm for computing the intersection of two convex polyhedra in 3-space. Applications of this result to computing intersections, convex hulls, and Voronoi diagrams are also given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007